Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Compressed sensing magnetic resonance imaging based on deep priors and non-local similarity
ZONG Chunmei, ZHANG Yueqin, CAO Jianfang, ZHAO Qingshan
Journal of Computer Applications    2020, 40 (10): 3054-3059.   DOI: 10.11772/j.issn.1001-9081.2020030285
Abstract364)      PDF (1058KB)(367)       Save
Aiming at the problem of low reconstruction quality of the existing Compressed Sensing Magnetic Resonance Imaging (CSMRI) algorithms at low sampling rates, an imaging method combining deep priors and non-local similarity was proposed. Firstly, a deep denoiser and Block Matching and 3D filtering (BM3D) denoiser were used to construct a sparse representation model that can fuse multiple priori knowledge of images. Secondly, the undersampled k-space data was used to construct a compressed sensing magnetic resonance imaging optimization model. Finally, an alternative optimization method was used to solve the constructed optimization problem. The proposed algorithm can not only use the deep priors through the deep denoiser, but also use the non-local similarity of the image through the BM3D denoiser to reconstruct the image. Compared with the reconstruction algorithms based on BM3D, experimental results show that the proposed algorithm has the average peak signal-to-noise ratio of reconstruction increased about 1 dB at the sampling rates of 0.02, 0.06, 0.09 and 0.13. Compared with the existing MRI algorithm WaTMRI (Magnetic Resonance Imaging with Wavelet Tree sparsity),DLMRI (Dictionary Learning for Magnetic Resonance Imaging), DUMRI-BM3D (Magnetic Resonance Imaging based on Dictionary Updating and Block Matching and 3D filtering), etc, the images reconstructed by the proposed algorithm contain a lot of texture information, which are the closest to the original images.
Reference | Related Articles | Metrics
Propagation modeling and analysis of peer-to-peer botnet
FENG Liping, SONG Lipeng, WANG Hongbin, ZHAO Qingshan
Journal of Computer Applications    2015, 35 (1): 68-71.   DOI: 10.11772/j.issn.1001-9081.2015.01.0068
Abstract617)      PDF (543KB)(556)       Save

To effectively control large-scale outbreak, the propagation properties of the leeching P2P (Peer-to-Peer) botnet was studied using dynamics theory. Firstly, a delayed differential-equation model was proposed according to the formation of the botnet. Secondly, the threshold expression of controlling botnet was obtained by the explicit mathematical analysis. Finally, the numerical simulations verified the correctness of theoretical analysis. The theoretical analysis and experimental results show that the botnet can be completely eliminated if the basic reproduction number is less than 1. Otherwise, the defense measures can only reduce the scale of botnet. The simulation results show that decreasing the infection rate of bot programs or increasing the immune rate of nodes in the network can effectively inhibit the outbreak of botnet. In practice, the propagation of bot programs can be controlled by some measures, such as uneven distribution of nodes in the network, timely downloading patch and so on.

Reference | Related Articles | Metrics